一类数论函数的性质(Ⅱ)

For any given positive integer n≥1,the Euler functionφ(n) is defined to be the number of positive integers not exceeding n,which is relatively prime to n.ω(n) is defined to be the number of different prime divisors of n.In order to know the solvability of the function ofφ(φ(φ(n)))=2~(ω(n)),properties of the number theoretical functionφ(φ(n)) is studied in the paper.     

集值优化问题强有效解的Kuhn Tucker最优性条件

在局部凸空间中考虑集值优化问题（VP）在强有效解意义下的Kuhn-Tucker最优性条件．在近似锥．次类凸假设下利用择一性定理得到了（VP）取得强有效解的必要条件，利用基泛函的性质给出了（VP）取得强有效解的充分条件，最后给出了一种与（VP）等价的无约束规划。     

ℙmax variations related to slaloms

We prove the iteration lemmata, which are the key lemmata to show that extensions by Pmax variations satisfy absoluteness for Π₂-statements in the structure 〈H (ω ₂), ∈, NS_{ω 1}, R 〉 for some set R of reals in L (ℝ), for the following statements: (1) The cofinality of the null ideal is ℵ₁. (2) There exists a good basis of the strong measure zero ideal. (© 2006 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Non-linear approximations for natural convection in a horizontal annulus

Two different problems are proposed as approximations of the usual system modelling natural convection under the Oberbeck-Boussinesq assumptions. The error is evaluated by means of the norm of its gradient in the Hilbert space. The average Nusselt number is also estimated.     

向量变分不等式的严格可行性问题

本篇文章首先定义了向量变分不等式的严格可行点概念,其次在假设了映射是强(D)-伪单调的情况下,证明了向量变分不等式解集非空有界与其严格可行点存在的等价性问题,推广了在数量变分不等式上得到的相应结果．     

Supercompactness and measurable limits of strong cardinals II: Applications to level by level equivalence

We construct models for the level by level equivalence between strong compactness and supercompactness in which for κ the least supercompact cardinal and δ ≤ κ any cardinal which is either a strong cardinal or a measurable limit of strong cardinals, 2^δ > δ ⁺ and δ is < 2^δ supercompact. In these models, the structure of the class of supercompact cardinals can be arbitrary, and the size of the power set of κ can essentially be made as large as desired. This extends and generalizes [5, Theorem 2] and [4, Theorem 4]. We also sketch how our techniques can be used to establish a weak indestructibility result. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On a generalization of Pólya’s theorem

We consider generalizations of Pólya’s theorem to the case of entire functions taking algebraic values at natural or integer points.     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).